Bus Driver Scheduling Problem using TLBO and JAYA Algorithm
نویسنده
چکیده
Bus driver scheduling problem is one of most important and complex problem faced by many companies and bus terminals. This paper attempts to solve this problem using paramterless evolutionary algorithms, TLBO and JAYA algorithm. The objective of this paper is to assign the drivers to duty on a particular day and block duty by satisfying the constraints. Algorithms are tested on four randomly generated datasets. In the work solution is obtained with no zero constraint violations. JAYA algorithm gives better results than TLBO algorithm.
منابع مشابه
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملThe Bus-Driver Scheduling Problem
We present new metaheuristics for solving real crew scheduling problems in a public transportation bus company. Since the crews of these companies are drivers, we will designate the problem by the bus-driver scheduling problem. Crew scheduling problems are well known and several mathematical programming based techniques have been proposed to solve them, in particular using the set-covering form...
متن کاملOptimal Placement of Capacitor Banks Using a New Modified Version of Teaching-Learning- Based Optimization Algorithm
Meta-heuristics optimization methods are important techniques for optimal design of the engineering systems. Numerous methods, inspired by different nature phenomena, have been introduced in the literature. A new modified version of Teaching-Learning-Based Optimization (TLBO) Algorithm is introduced in this paper. TLBO, as a parameter free algorithm, is based on the learning procedure of studen...
متن کاملSolving a Large Real-world Bus Driver Scheduling Problem with a Multi-assignment based Heuristic Algorithm
The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristic algorithm is proposed using multiple assignment problems that arise from a model based on a weighted multipartite graph. In the first phase, the ...
متن کامل